On Amenability of Automata Groups
نویسندگان
چکیده
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups (“Mother groups”) which is done by analyzing the asymptotic properties of random walks on these groups.
منابع مشابه
Extensions of amenable groups by recurrent groupoids
We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This applies to a wide class of groups, amenability of which was an open problem, as well as unifies many known examples to one general proof. In particular, this includes Grigorchuk’s group, Basilica group, groups associated with...
متن کاملAmenability of groups is characterized by Myhill's Theorem
We prove a converse to Myhill’s “Garden-of-Eden” theorem and obtain in this manner a characterization of amenability in terms of cellular automata: A group G is amenable if and only if every cellular automaton with carrier G that has gardens of Eden also has mutually erasable patterns. This answers a question by Schupp, and solves a conjecture by CeccheriniSilberstein, Mach̀ı and Scarabotti.
متن کاملAmenability of groups and semigroups characterized by configuration
In 2005, A. Abdollahi and A. Rejali, studied the relations betweenparadoxical decomposition and configuration for semigroups. In thepresent paper, we introduce one other concept of amenability typeon semigroups and groups which includes amenability of semigroupsand inner-amenability of groups. We have extend the previous knownresults to semigroups and groups satisfying this concept.
متن کاملA converse to Moore's theorem on cellular automata
We prove a converse to Moore’s “Garden-of-Eden” theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in [11; 1, Conjecture 6.2] that amenability could be characterized by cellular automata. We prove the first part of that conjecture.
متن کاملCloud modeling of quasi - order groups on general fuzzy automata
In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...
متن کامل